134 research outputs found

    A New Domain Decomposition Method for the Compressible Euler Equations

    Get PDF
    In this work we design a new domain decomposition method for the Euler equations in 2 dimensions. The basis is the equivalence via the Smith factorization with a third order scalar equation to whom we can apply an algorithm inspired from the Robin-Robin preconditioner for the convection-diffusion equation. Afterwards we translate it into an algorithm for the initial system and prove that at the continuous level and for a decomposition into 2 sub-domains, it converges in 2 iterations. This property cannot be preserved strictly at discrete level and for arbitrary domain decompositions but we still have numerical results which confirm a very good stability with respect to the various parameters of the problem (mesh size, Mach number, ....).Comment: Submitte

    Stabilised hybrid discontinuous Galerkin methods for the Stokes problem with non-standard boundary conditions

    Get PDF
    In several studies it has been observed that, when using stabilised Pk×Pk\mathbb{P}_k^{}\times\mathbb{P}_k^{} elements for both velocity and pressure, the error for the pressure is smaller, or even of a higher order in some cases, than the one obtained when using inf-sup stable Pk×Pk1\mathbb{P}_k^{}\times\mathbb{P}_{k-1}^{} (although no formal proof of either of these facts has been given). This increase in polynomial order requires the introduction of stabilising terms, since the finite element pairs used do not stability the inf-sup condition. With this motivation, we apply the stabilisation approach to the hybrid discontinuous Galerkin discretisation for the Stokes problem with non-standard boundary conditions

    Optimized Schwarz Methods for Maxwell equations

    Get PDF
    Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, and it was observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for which overlap is essential for convergence. Over the last decade, optimized Schwarz methods have been developed for elliptic partial differential equations. These methods use more effective transmission conditions between subdomains, and are also convergent without overlap for elliptic problems. We show here why the classical Schwarz method applied to the hyperbolic problem converges without overlap for Maxwell's equations. The reason is that the method is equivalent to a simple optimized Schwarz method for an equivalent elliptic problem. Using this link, we show how to develop more efficient Schwarz methods than the classical ones for the Maxwell's equations. We illustrate our findings with numerical results

    Solution of the time-harmonic Maxwell equations using discontinuous Galerkin methods

    Get PDF
    We present numerical results concerning the solution of the time-harmonic Maxwell's equations discretized by discontinuous Galerkin methods. In particular, a numerical study of the convergence, which compares different strategies proposed in the literature for the elliptic Maxwell equations, is performed in the two-dimensional case.Comment: Preprint submitted for publication for the proceedings of ICCAM06 (11/04/2007

    A Two Level Domain Decomposition Preconditionner Based on Local Dirichlet to Neumann Maps

    Get PDF
    Coarse grid correction is a key ingredient in order to have scalable domain decomposition methods. In this work we construct the coarse grid space using the low frequency modes of the subdomain DtN (Dirichlet-Neumann) maps, and apply the obtained two-level preconditioner to the linear system arising from an overlapping domain decomposition. Our method is suitable for the parallel implementation and its efficiency is demonstrated by numerical examples on problems with high heterogeneities

    An inconditionnally stable discontinuous Galerkin method for solving the 2D time-domain Maxwell equations on unstructured triangular meshes

    Get PDF
    Numerical methods for solving the time-domain Maxwell equations often rely on cartesian meshes and are variants of the finite difference time-domain (FDTD) method due to Yee. In the recent years, there has been an increasing interest in discontinuous Galerkin time-domain (DGTD) methods dealing with unstructured meshes since the latter are particularly well adapted to the discretization of geometrical details that characterize applications of practical relevance. However, similarly to Yee's finite difference time-domain method, existing DGTD methods generally rely on explicit time integration schemes and are therefore constrained by a stability condition that can be very restrictive on locally refined unstructured meshes. An implicit time integration scheme is a possible strategy to overcome this limitation. The present study aims at investigating such an implicit DGTD method for solving the 2D time-domain Maxwell equations on non-uniform triangular meshes

    Locally implicit discontinuous Galerkin method for time domain electromagnetics

    Get PDF
    In the recent years, there has been an increasing interest in discontinuous Galerkin time domain (DGTD) methods for the solution of the unsteady Maxwell equations modeling electromagnetic wave propagation. One of the main features of DGTD methods is their ability to deal with unstructured meshes which are particularly well suited to the discretization of the geometrical details and heterogeneous media that characterize realistic propagation problems. Such DGTD methods most often rely on explicit time integration schemes and lead to block diagonal mass matrices. However, explicit DGTD methods are also constrained by a stability condition that can be very restrictive on highly refined meshes and when the local approximation relies on high order polynomial interpolation. An implicit time integration scheme is a natural way to obtain a time domain method which is unconditionally stable but at the expense of the inversion of a global linear system at each time step. A more viable approach consists of applying an implicit time integration scheme locally in the refined regions of the mesh while preserving an explicit time scheme in the complementary part, resulting in an hybrid explicit–implicit (or locally implicit) time integration strategy. In this paper, we report on our recent efforts towards the development of such a hybrid explicit–implicit DGTD method for solving the time domain Maxwell equations on unstructured simplicial meshes. Numerical experiments for 3D propagation problems in homogeneous and heterogeneous media illustrate the possibilities of the method for simulations involving locally refined meshes

    Robust Methods for Multiscale Coarse Approximations of Diffusion Models in Perforated Domains

    Full text link
    For the Poisson equation posed in a domain containing a large number of polygonal perforations, we propose a low-dimensional coarse approximation space based on a coarse polygonal partitioning of the domain. Similarly to other multiscale numerical methods, this coarse space is spanned by locally discrete harmonic basis functions. Along the subdomain boundaries, the basis functions are piecewise polynomial. The main contribution of this article is an error estimate regarding the H1-projection over the coarse space which depends only on the regularity of the solution over the edges of the coarse partitioning. For a specific edge refinement procedure, the error analysis establishes superconvergence of the method even if the true solution has a low general regularity. Combined with domain decomposition (DD) methods, the coarse space leads to an efficient two-level iterative linear solver which reaches the fine-scale finite element error in few iterations. It also bodes well as a preconditioner for Krylov methods and provides scalability with respect to the number of subdomains. Numerical experiments showcase the increased precision of the coarse approximation as well as the efficiency and scalability of the coarse space as a component of a DD algorithm.Comment: 32 pages, 14 figures, submitted to Journal of Computational Physic
    corecore